Static Analysis of Distributed Systems with Mobility Specified by Graph Grammars—A Case Study
نویسندگان
چکیده
We consider a distributed system with mobility modelled as a graph transformation system. Then we show that non-secure level processes cannot influence secure level processes, a property formalized as the absence of causal dependencies between such processes. This is done by resorting to an analysis technique for graph transformation systems, called approximated unfolding, based on the construction of an approximation of the unfolding semantics.
منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملTriple Graph Grammars or Triple Graph Transformation Systems?
Triple graph grammars have been used to specify consistency maintenance between inter-dependent and evolving models at a high level of abstraction. On a lower level, consistency maintenance may be specified by a triple graph transformation system, which takes care of all operational details required for executing consistency maintenance operations. We present a case study from software configur...
متن کاملA comparative study on scapular static position between femaleswith and without generalized joint hyper mobility
Background: Generalized joint hyper mobility predisposes some individuals to a wide variety of musculoskeletal complaints. Given the critical role of scapular position in function of shoulder, the aim of this study was to compare scapular position between persons with and without general joint hyper mobility. Methods: By nonprobability sampling 30 hyper mobile persons at average of 22.86 ±2.77...
متن کاملAbstract Interpretation of Graph Grammars
Interpretation of Graph Grammars ? Jörg Bauer and Reinhard Wilhelm Informatik; Univ. des Saarlandes; Saarbrücken, Germany. {joba,wilhelm}@cs.uni-sb.de Abstract. Many communication systems, distributed algorithms, or heap manipulating programs are hard to verify due to their inherent unboundedness. Their semantics can be described by evolving graphs. Graph grammars are a natural, intuitive, and ...
متن کاملStatic Analysis of Dynamic Communication Systems
Prominent examples of dynamic communication systems include traffic control systems and ad hoc networks. Dynamic communication systems are hard to verify due to inherent unboundedness. Unbounded creation and destruction of objects and a dynamically evolving communication topology are characteristic features. Partner graph grammars are presented as an adequate specification formalism for dynamic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002